1010B - Rocket - CodeForces Solution

#include <bits/stdc++.h>

using namespace std;

#define int long long
#define nl '\n'
#define V vector

signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    int m, n;
    cin >> m >> n;
    V<bool> p(n);
    for(int i = 0; i < n; i++) {
        cout << m << endl;
        int judge;
        cin >> judge;
        if(judge == 0) {
            exit(0);
        }
        p[i] = judge == -1;
    }
    int pos = 0;
    int l = 1, r = m;
    while(l <= r) {
        int mid = (l + r) / 2;

        cout << mid << endl;
        int judge;
        cin >> judge;
        if(!p[pos]) judge = -judge;
        if(judge == 0){
            exit(0);
        } else if(judge == -1) {
            r = mid - 1;
        } else {
            l = mid + 1;
        }
        pos = (pos + 1) % n;
    }
    return 0;
}